Dynamic synthesis for relaxed memory models
نویسندگان
چکیده
منابع مشابه
Predicate Abstraction for Relaxed Memory Models
We present a novel approach for predicate abstraction of programs running on relaxed memory models. Our approach consists of two steps. First, we reduce the problem of verifying a program P running on a memory model M to the problem of verifying a program PM that captures an abstraction of M as part of the program. Second, we present a new technique for discovering predicates that enable verifi...
متن کاملGenerative Operational Semantics for Relaxed Memory Models
The specification of the Java Memory Model (JMM) is phrased in terms of acceptors of execution sequences rather than the standard generative view of operational semantics. This creates a mismatch with language-based techniques, such as simulation arguments and proofs of type safety. We describe a semantics for the JMM using standard programming language techniques that captures its full express...
متن کاملPredicate Abstraction for Relaxed Memory Models
We present a novel approach for predicate abstraction of programs running on relaxed memory models. Our approach consists of two steps. First, we reduce the problem of verifying a program P running on a memory model M to the problem of verifying a program PM that captures an abstraction of M as part of the program. Second, we show how to discover new predicates that enable verification of PM . ...
متن کاملEffective Program Verification for Relaxed Memory Models
Program verification for relaxed memory models is hard. The highdegree of nondeterminism in such models challenges standard ver-ification techniques. This paper proposes a new verification tech-nique for the most common relaxation, store buffers. Crucial tothis technique is the observation that all programmers, includingthose who use low-lock techniques for performance, expe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2012
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2345156.2254115